Efficient Algorithms for Approximate Reasoning
نویسنده
چکیده
We present algorithms for approximate reasoning computations, for some intersection and implication functions, which are as efficient as Mamdani’s interpolation method. Implementations of the algorithms are given in the functional language Mi r a n d a.
منابع مشابه
PROPERTY ANALYSIS OF TRIPLE IMPLICATION METHOD FOR APPROXIMATE REASONING ON ATANASSOVS INTUITIONISTIC FUZZY SETS
Firstly, two kinds of natural distances between intuitionistic fuzzy sets are generated by the classical natural distance between fuzzy sets under a unified framework of residual intuitionistic implication operators. Secondly, the continuity and approximation property of a method for solving intuitionistic fuzzy reasoning are defined. It is proved that the triple implication method for intuitio...
متن کاملILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
متن کاملApproximate Boolean Reasoning Approach to Rough Sets and Data Mining
Many problems in rough set theory have been successfully solved by boolean reasoning (BR) approach. The disadvantage of this elegant methodology is based on its high space and time complexity. In this paper we present a modified BR approach that can overcome those difficulties. This methodology is called the approximate boolean reasoning (ABR) approach. We summarize some most recent application...
متن کاملWhat Is Approximate Reasoning?
Approximate reasoning for the Semantic Web is based on the idea of sacrificing soundness or completeness for a significant speedup of reasoning. This is to be done in such a way that the number of introduced mistakes is at least outweighed by the obtained speed-up. When pursuing such approximate reasoning approaches, however, it is important to be critical not only about appropriate application...
متن کاملApproximate OWL-Reasoning with Screech
With the increasing interest in expressive ontologies for the Semantic Web, it is critical to develop scalable and efficient ontology reasoning techniques that can properly cope with very high data volumes. For certain application domains, approximate reasoning solutions, which trade soundness or completeness for inctreased reasoning speed, will help to deal with the high computational complexi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004